A Partitioned Binary Search Scheme on Multiple Trees for Efficient IP Address Lookup
نویسندگان
چکیده
IP address lookup is becoming critical because of increasing entries in a forwarding table, linespeed and traffic in the Internet. Binary search is the most popular scheme based on S/W implementation. This search scheme has problems according to the parentchild relationship of prefixes. In this paper, we proposed the partitioned binary search scheme to split the parentchild relationship. All prefixes were classified as disjoint prefixes, enclosure prefixes, and child prefixes, and then were stored and searched separately. Performance results show that the required memory size is 151Kbytes to store about 30K entries and an address lookup on average is achieved by 8.23 memory accesses.
منابع مشابه
An Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector
Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binar...
متن کاملA Fast IP Address Lookup Algorithm Based on Search Space Reduction
This letter proposes a fast IP address lookup algorithm based on search space reduction. Prefixes are classified into three types according to the nesting relationship and a large forwarding table is partitioned into multiple small trees. As a result, the search space is reduced. The results of analyses and experiments show that the proposed method offers higher lookup and updating speeds along...
متن کاملFast Packet Classification for Two-Dimensional Conflict-Free Filters
Routers can use packet classification to support advanced functions such as QoS routing, virtual private networks and access control. Unlike traditional routers, which forward packets based on destination address only, routers with packet classification capability can forward packets based on multiple header fields, such as source address, protocol type, or application port numbers. The destina...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کامل